On striking for a bargain between two completely informed agents
نویسندگان
چکیده
منابع مشابه
a cross-comparative dtudy between two textbook series in terms of the presentation of politeness
چکیده ندارد.
15 صفحه اولFlocking with informed agents
© Société de Mathématiques Appliquées et Industrielles, 2008, tous droits réservés. L’accès aux articles de la revue « MathematicS In Action » (http://msia.cedram.org/), implique l’accord avec les conditions générales d’utilisation (http://msia.cedram.org/legal/). Toute utilisation commerciale ou impression systématique est constitutive d’une infraction pénale. Toute copie ou impression de ce f...
متن کاملTwo counterexamples on completely independent spanning trees
For each k ≥ 2, we construct a k-connected graph which does not contain two completely independent spanning trees. This disproves a conjecture of Hasunuma. Furthermore, we also give an example for a 3-connected maximal plane graph not containing two completely independent spanning trees.
متن کاملStrategic Negotiation for Sharing a Resource Between two Agents
In this paper, we propose a strategic-negotiation model which enables self-motivated rational agents to share resources. The strategic-negotiation model takes the passage of time during the negotiation process itself into account. The model considers bilateral negotiations in situations characterized by complete information, in which one agent loses over time while the other gains over time. Us...
متن کاملTwo Remarks on Completely Random Priors
Kingman’s notion of a completely random measure [Kin67] on a measurable space (X,X) is adapted to the case of uniform total mass which gives rise to the notion of a completely random prior. If X is an interval the completely random priors are in one-to-one correspondence with subordinator bridges.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Economic Theory
سال: 2007
ISSN: 0938-2259,1432-0479
DOI: 10.1007/s00199-007-0306-8